On a faithful representation of Sturmian morphisms
نویسندگان
چکیده
The set of morphisms mapping any Sturmian sequence to a forms together with composition the so-called monoid Sturm. For this monoid, we defne faithful representation by $(3\times 3)$-matrices integer entries. We find three convex cones in $\mathbb{R}^3$ and show that matrix $R \in Sl(\mathbb{Z},3)$ is representing morphism if are invariant under multiplication $R$ or $R^{-1}$. This property offers new tool study sequences. provide alternative proofs four known results on sequences fixed primitive result concerning square root sequence.
منابع مشابه
A Characterization of Sturmian Morphisms
A one-sided infinite word is balanced if the difference of the number of occurrences of a letter in two factors of the same length never exceeds one. It is Sturmian if it is balanced and not ultimately periodic. Sturmian words have a long history. A clear exposition of early work by J. Bernoulli, Christoffel, and A. A. Markov is given in the book by Venkov [22]. The term "Sturmian" has been use...
متن کاملQuasiperiodic Sturmian words and morphisms
We characterize all quasiperiodic Sturmian words: a Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity.
متن کاملOn an involution of Christoffel words and Sturmian morphisms
There is a natural involution on Christoffel words, originally studied by the second author in [dL2]. We show that it has several equivalent definitions: one of them uses the slope of the word, and changes the numerator and the denominator respectively in their inverses modulo the length; another one uses the cyclic graph allowing the construction of the word, by interpreting it in two ways (on...
متن کاملA Representation of Sturmian Strings
In this paper we introduce a class of morphisms that collectively can be used to represent all Sturmian strings.
متن کاملWords and morphisms with Sturmian erasures
We say x ∈ {0, 1, 2}N is a word with Sturmian erasures if for any a ∈ {0, 1, 2} the word obtained erasing all a in x is a Sturmian word. A large family of such words is given coding trajectories of balls in the game of billiards in the cube. We prove that the monoid of morphisms mapping all words with Sturmian erasures to words with Sturmian erasures is not finitely generated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2023
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2023.103707